Efficient characterization of high-dimensional parameter spaces for systems biology
نویسندگان
چکیده
منابع مشابه
Preset based interaction with high dimensional parameter spaces
Many systems require the setting of a large number of parameters. This is often a difficult and time consuming task, especially for novice users. A framework is presented to simplify this task. Settings are defined as a weighted sum of a number of presets, thereby bridging the gap between the expert mode of setting all individual parameters and the novice user mode of selecting presets. Several...
متن کاملEfficient Greedy Algorithms for High-dimensional Parameter Spaces with Applications to Empirical Interpolation and Reduced Basis Methods
We propose two new algorithms to improve greedy sampling of high-dimensional functions. While the techniques have a substantial degree of generality, we frame the discussion in the context of methods for empirical interpolation and the development of reduced basis techniques for high-dimensional parametrized functions. The first algorithm, based on a saturation assumption of the error in the gr...
متن کاملAn efficient nearest neighbor search in high-dimensional data spaces
Similarity search in multimedia databases requires an efficient support of nearest neighbor search on a large set of high-dimensional points. A technique applied for similarity search in multimedia databases is to transform important properties of the multimedia objects into points of a high-dimensional feature space. The feature space is usually indexed using a multidimensional index structure...
متن کاملCyclic wavelet systems in prime dimensional linear vector spaces
Finite affine groups are given by groups of translations and di- lations on finite cyclic groups. For cyclic groups of prime order we develop a time-scale (wavelet) analysis and show that for a large class of non-zero window signals/vectors, the generated full cyclic wavelet system constitutes a frame whose canonical dual is a cyclic wavelet frame.
متن کاملLearning and exploiting low-dimensional structure for efficient holonomic motion planning in high-dimensional spaces
We present a class of methods for optimal holonomic planning in high dimensional spaces that automatically learns and leverages low dimensional structure to efficiently find high quality solutions. These methods are founded on the principle that problems possessing such structure are inherently simple to solve. This is demonstrated by presenting algorithms to solve these problems in time that s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Systems Biology
سال: 2011
ISSN: 1752-0509
DOI: 10.1186/1752-0509-5-142